1-D Optimum Path Problem and Its Application

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

construction and validation of translation metacognitive strategy questionnaire and its application to translation quality

like any other learning activity, translation is a problem solving activity which involves executing parallel cognitive processes. the ability to think about these higher processes, plan, organize, monitor and evaluate the most influential executive cognitive processes is what flavell (1975) called “metacognition” which encompasses raising awareness of mental processes as well as using effectiv...

Control Problem and its Application in Management and Economic

The control problem and Dynamic programming is a powerful tool in economics and management. We review the dynamic programming problem from its beginning up to its present stages. A problem which was involved in physics and mathematics in I 7” century led to a branch of mathematics called calculus of variation which was used in economic, and management at the end of the first quarter of the 20” ...

متن کامل

An Improved Protocol for Securely Solving the Shortest Path Problem and its Application to Combinatorial Auctions

We propose a protocol to securely compute the solution to the (single source) Shortest Path Problem, based on Dijkstra’s algorithm and Secure Multiparty Computation. Our protocol improves state of the art by Aly et al. [FC 2013 & ICISC 2014] and offers perfect security against both semi-honest and malicious adversaries. Moreover, it can easily be adapted to form a subroutine in other combinator...

متن کامل

Optimum Path Packing on Wheels :

We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that no two terminal pairs cross, then a path packing, i. e., a collection of edge disjoint paths connecting the given terminal pairs, of minimum length can be found in strongly polynomial time. Moreover, we exhibit for this case a system of linear inequalities that provides ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Academic Journal of Applied Mathematical Sciences

سال: 2021

ISSN: 2415-2188,2415-5225

DOI: 10.32861/ajams.72.137.142